Subresiduated lattice ordered commutative monoids
نویسندگان
چکیده
A subresiduated lattice ordered commutative monoid (or srl-monoid for short) is a with particular subalgebra which contains residuated implication. The srl-monoids can be regarded as algebras that generalize lattices and respectively. In this paper we prove the class of forms variety. We show congruences any isomorphic to its strongly convex subalgebras also give description generated by subset negative cone srl-monoid. apply both results in order study giving application alternative equational basis variety totally members. above mentioned prelinear integral srl-monoids, whose expansion bottom seen generalization MTL-algebras.
منابع مشابه
Corrigendum: Residuation in Commutative Ordered Monoids with Minimal Zero
The assertional logic S(BCIA) of the quasivariety of BCI-algebras (in Iseki's sense) is axiomatized, relative to pure implicational logic BCI, by the rule x, y, x → y (G) (see [1]). Alternatively, the role of (G) can be played by x x → (y → y) (1) (see [2]). The formula (x → x) → (y → y) (2) is a theorem of S(BCIA). In [2, Proposition 22] we claimed erroneously that, relative to BCI, the axiom ...
متن کاملFilter Theory of Bounded Residuated Lattice Ordered Monoids
Bounded residuated lattice ordered monoids (R -monoids) are a common generalization of pseudo-BL-algebras and Heyting algebras, i.e. algebras of the non-commutative basic fuzzy logic (and consequently of the basic fuzzy logic, the Łukasiewicz logic and the non-commutative Łukasiewicz logic) and the intuitionistic logic, respectively. In the paper we introduce and study classes of filters of bou...
متن کاملClasses of Fuzzy Filters of Residuated Lattice Ordered Monoids
The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. Bounded residuated lattice ordered monoids (Rl-monoids) are common generalizations of BL-algebras, i.e., algebras of the propositional basic fuzzy logic, and Heyting algebras, i.e., algebras of the propositional intuitionistic logic. From the point of view of uncertain i...
متن کاملPartially Commutative Inverse Monoids
Free partially commutative inverse monoids are investigated. Analogously to free partially commutative monoids (trace monoids), free partially commutative inverse monoids are the quotients of free inverse monoids modulo a partially defined commutation relation on the generators. A quasi linear time algorithm for the word problem is presented, more precisely, we give an O(n log(n)) algorithm for...
متن کاملOrdered monoids and J-trivial monoids
In this paper we give a new proof of the following result of Straubing and Thérien: every J -trivial monoid is a quotient of an ordered monoid satisfying the identity x ≤ 1. We will assume in this paper that the reader has a basic background in finite semigroup theory (in particular, Green’s relations and identities defining varieties) and in computer science (languages, trees, heaps). All semi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fuzzy Sets and Systems
سال: 2023
ISSN: ['1872-6801', '0165-0114']
DOI: https://doi.org/10.1016/j.fss.2022.12.003